منابع مشابه
On the VC-dimension of neural networks with binary weights
We investigate the VC-dimension of the perceptron and simple two-layer networks like the committeeand the parity-machine with weights restricted to values ±1. For binary inputs, the VC-dimension is determined by atypical pattern sets, i.e. it cannot be found by replica analysis or numerical Monte Carlo sampling. For small systems, exhaustive enumerations yield exact results. For systems that ar...
متن کاملOn the Eeective Vc Dimension
The very idea of an \EEective Vapnik Chervonenkis (VC) dimension" (Vapnik, Levin and Le Cun, 1993) relies on the hypothesis that the relation between the generalization error and the number of training examples can be expressed by a formula algebraically similar to the VC bound. This hypothesis calls for a serious discussion since the traditional VC bound widely overestimates the generalization...
متن کاملIdentifying codes in hereditary classes of graphs and VC-dimension
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملOn the Approximability of Partial VC Dimension
We introduce the problem Partial VC Dimension that asks, given a hypergraph H = (X,E) and integers k and l, whether one can select a set C ⊆ X of k vertices of H such that the set {e ∩ C, e ∈ E} of distinct hyperedge-intersections with C has size at least l. The sets e ∩ C define equivalence classes over E. Partial VC Dimension is a generalization of VC Dimension, which corresponds to the case ...
متن کاملOn the VC-dimension of uniform hypergraphs
Let F be a k-uniform hypergraph on [n] where k − 1 is a power of some prime p and n ≥ n0(k). Our main result says that if |F | > ( n k−1 ) − logp n + k!kk , then there exists E0 ∈ F such that {E ∩ E0 : E ∈ F} contains all subsets of E0. This improves a longstanding bound of ( n k−1 ) due to Frankl and Pach [7].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2018
ISSN: 0895-4801,1095-7146
DOI: 10.1137/18m116486x